/**
 * Copyright (c) 2025 Huawei Technologies Co., Ltd.
 * This program is free software, you can redistribute it and/or modify it under the terms and conditions of
 * CANN Open Software License Agreement Version 2.0 (the "License").
 * Please refer to the License for details. You may not use this file except in compliance with the License.
 * THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED,
 * INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY, OR FITNESS FOR A PARTICULAR PURPOSE.
 * See LICENSE in the root of the software repository for the full text of the License.
 */

#include "fftplan/fft_plan_cache.h"

namespace FFTPlanCache {

static std::unordered_map<AsdSip::asdFftHandle, std::unique_ptr<AsdSip::FFTPlan>> plans;

AsdSip::asdFftHandle makePlan()
{
    AsdSip::asdFftHandle handle = new AsdSip::FFTPlan{};

    plans.insert({handle, std::unique_ptr<AsdSip::FFTPlan>(static_cast<AsdSip::FFTPlan *>(handle))});
    return handle;
}

bool doesPlanExist(AsdSip::asdFftHandle &handle)
{
    if (plans.find(handle) == plans.end()) {
        return false;
    }

    return true;
}

AsdSip::FFTPlan &getPlan(AsdSip::asdFftHandle &handle)
{
    return *(plans.at(handle));
}

void destroyPlan(AsdSip::asdFftHandle &handle)
{
    plans.erase(handle);
}

}
